Reading Dependencies from the Minimal Undirected Independence Map of a Graphoid that Satisfies Weak Transitivity
نویسندگان
چکیده
We present a sound and complete graphical criterion for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity. We argue that assuming weak transitivity is not too restrictive.
منابع مشابه
An Algorithm for Reading Dependencies from the Minimal Undirected Independence Map of a Graphoid that Satisfies Weak Transitivity
We present a sound and complete graphical criterion for reading dependencies from the minimal undirected independence map G of a graphoid M that satisfies weak transitivity. Here, complete means that it is able to read all the dependencies in M that can be derived by applying the graphoid properties and weak transitivity to the dependencies used in the construction of G and the independencies o...
متن کاملReading Dependencies from Polytree-Like Bayesian Networks
We present a graphical criterion for reading dependencies from the minimal directed independence map G of a graphoid p when G is a polytree and p satisfies composition and weak transitivity. We prove that the criterion is sound and complete. We argue that assuming composition and weak transitivity is not too restrictive.
متن کاملReading Dependencies from Polytree-Like Bayesian Networks Revisited
We present a graphical criterion for reading dependencies from the minimal directed independence map G of a graphoid p, under the assumption that G is a polytree and p satisfies weak transitivity. We prove that the criterion is sound and complete. We argue that assuming weak transitivity is not too restrictive.
متن کاملReading Dependencies from Covariance Graphs
The covariance graph (aka bi-directed graph) of a probability distribution p is the undirected graph G where two nodes are adjacent iff their corresponding random variables are marginally dependent in p.∗ In this paper, we present a graphical criterion for reading dependencies from G, under the assumption that p satisfies the graphoid properties as well as weak transitivity and composition. We ...
متن کاملChain graphs: semantics and expressiveness
A chain graph (CG) is a graph admitting both directed and undirected edges with forbidden directed cycles. It generalizes both the concept of undirected graph (UG) and the concept of directed acyclic graph (DAG). CGs can be used eeciently to store graphoids, that is, independency knowledge of the form \X is independent of Y given Z" obeying a set of ve properties (axioms). Two equivalent criter...
متن کامل